An iterated greedy algorithm for the parallel blocking flow shop scheduling problem and sequence-dependent setup times

This paper deals with the problem of scheduling jobs in a parallel flow shop configuration under blocking constraint, which setup time machines depends not only on job to be processed but also previously one, i.e., there are sequence-dependent times. The performance analysis several iterated greedy algorithms different initial solution procedures and local searches lets us define an efficient algorithm minimize maximum completion time. Moreover, computational evaluation showed efficiency searching neighborhood structures noted significant influence solution. However, contrary other problems, starting high quality does guarantee better algorithm.